Colourings of graphs with two consecutive odd cycle lengths
نویسندگان
چکیده
In 1992 Gyárfás showed that a graph G having only k odd cycle lengths is (2k + 1)colourable, if it does not contain a K2k+2. In this paper, we will present the results for graphs containing only odd cycles of length 2m − 1 and 2m + 1 as done in [S. Matos Camacho, Colourings of graph with prescribed cycle lengths, diploma thesis, TU Bergakademie Freiberg, 2006. [3]]. We will show that these graphs are 4-colourable. © 2008 Elsevier B.V. All rights reserved.
منابع مشابه
RECONFIGURING k-COLOURINGS OF COMPLETE BIPARTITE GRAPHS
Let H be a graph, and k ≥ χ(H) an integer. We say that H has a Gray code of k-colourings if and only if it is possible to list all its k-colourings in such a way that consecutive colourings (including the last and the first) agree on all vertices of H except one. The Gray code number of H is the least integer k0(H) such that H has a Gray code of its k-colourings for all k ≥ k0(H). For complete ...
متن کاملA note on n-tuple colourings and circular colourings of planar graphs with large odd girth
International Journal of Computer Mathematics Publication details, including instructions for authors and subscription information: http://www.informaworld.com/smpp/title~content=t713455451 A note on n-tuple colourings and circular colourings of planar graphs with large odd girth P. šparl ab; J. žerovnik ac a IMFM, Slovenia b FG, University of Maribor, Slovenia c FS, University of Maribor, Slov...
متن کامل0n removable cycles in graphs and digraphs
In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...
متن کاملCycle length parities and the chromatic number
In 1966 Erdős and Hajnal proved that the chromatic number of graphs whose odd cycles have lengths at most l is at most l + 1. Similarly, in 1992 Gyárfás proved that the chromatic number of graphs which have at most k odd cycle lengths is at most 2k + 2 which was originally conjectured by Bollobás and Erdős. Here we consider the influence of the parities of the cycle lengths modulo some odd prim...
متن کاملCycles in triangle-free graphs of large chromatic number
More than twenty years ago Erdős conjectured [4] that a triangle-free graph G of chromatic number k ≥ k0(ε) contains cycles of at least k2−ε different lengths as k →∞. In this paper, we prove the stronger fact that every triangle-free graph G of chromatic number k ≥ k0(ε) contains cycles of 1 64 (1− ε)k 2 log k4 consecutive lengths, and a cycle of length at least 14 (1− ε)k 2 log k. As there ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009